A Parametric Method for Semidefinite Quadratic Programs
نویسندگان
چکیده
منابع مشابه
A randomized method for solving semidefinite programs
Proposed is a novel iterative method for solving semidefinite programs. It exploits the ideology of cutting hyperplane through the center of mass of a convex body. To estimate the center of mass, we use a random walk technique known as the Hit-and-Run algorithm. The results of numerical simulations are compared to those obtained with presently available approaches. Robust versions of the method...
متن کاملApproximating Quadratic Programs with Semidefinite Relaxations
Given an arbitrary matrix A in which all of the diagonal elements are zero, we would like to find x1, x2, . . . , xn ∈ {−1, 1} such that ∑n i=1 ∑n j=1 aijxixj is maximized. This problem has an important application in correlation clustering, and is also related to the well-known inequality of Grothendieck in functional analysis. While solving quadratic programs is NP-hard, we can approximate th...
متن کاملSolving semidefinite-quadratic-linear programs using SDPT3
This paper discusses computational experiments with linear optimization problems involving semidefinite, quadratic, and linear cone constraints (SQLPs). Many test problems of this type are solved using a new release of SDPT3, a Matlab implementation of infeasible primal-dual path-following algorithms. The software developed by the authors uses Mehrotratype predictor-corrector variants of interi...
متن کاملQuadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
We consider a Newton-type method for the solution of semidefinite programs. This Newton-type method is based on a semismooth reformulation of the semidefinite program as a nonsmooth system of equations. We establish local quadratic convergence of this method under a linear independence assumption and a slightly modified nondegeneracy condition. In contrast to previous investigations, however, t...
متن کاملA Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs
We present a coordinate ascent method for a class of semidefinite programming problems that arise in non-convex quadratic integer optimization. These semidefinite programs are characterized by a small total number of active constraints and by low-rank constraint matrices. We exploit this special structure by solving the dual problem, using a barrier method in combination with a coordinate-wise ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control
سال: 1969
ISSN: 0036-1402
DOI: 10.1137/0307041